Private Information Retrieval Schemes With Product-Matrix MBR Codes
نویسندگان
چکیده
A private information retrieval (PIR) scheme allows a user to retrieve file from database without revealing any on the being requested. As of now, PIR schemes have been proposed for several kinds storage systems, including replicated and MDS-coded systems. However, problem constructing regenerating codes has sparsely considered. code is whose codewords are distributed among nodes, enabling efficient files, as well low-bandwidth files repair nodes. Minimum-bandwidth (MBR) define family allowing node with optimal bandwidth. Rashmi, Shah, Kumar obtained large MBR using product-matrix (PM) construction. In this work, new over PM-MBR designed. The inherent redundancy PM structure used reduce download communication complexity scheme. lower bound capacity MBR-coded derived, showing an interesting space vs. rate trade-off compared existing same reconstruction capability. present also outperforms recent construction Dorkson Ng.
منابع مشابه
t-Private Information Retrieval Schemes Using Transitive Codes
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed and the resulting PIR rate is calculated explicitly. It is shown that codes with transitive automorphism groups yield the highest possible rates obtainable with the propo...
متن کاملNew Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N -bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only q bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. We give new constructions of three query LDCs of vastly shorter length than that of previous constructions. Specific...
متن کاملLocally Decodable Codes and Private Information Retrieval Schemes
This thesis studies two closely related notions, namely Locally Decodable Codes (LDCs) and Private Information Retrieval Schemes (PIRs). Locally decodable codes are error-correcting codes that allow extremely efficient, “sublinear-time” decoding procedures. More formally, a k-query locally decodable code encodes n-bit messages x in such a way that one can probabilistically recover any bit xi of...
متن کاملOn private information retrieval array codes
Given a database, the private information retrieval (PIR) protocol allows a user to make queries to several servers and retrieve a certain item of the database via the feedbacks, without revealing the privacy of the specific item to any single server. Classical models of PIR protocols require that each server stores a whole copy of the database. Recently new PIR models are proposed with coding ...
متن کاملLengthening and Extending Binary Private Information Retrieval Codes
It was recently shown by Fazeli et al. that the storage overhead of a traditional t-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a t-server PIR code. In this work, we show that a family of tserver PIR codes (with increasing dimensions and blocklengths) can be constructed from an existing t-server PIR code through lengthening by a single i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2021
ISSN: ['1556-6013', '1556-6021']
DOI: https://doi.org/10.1109/tifs.2020.3003572